Geometric multiscale decompositions of dynamic low-rank matrices
نویسنده
چکیده
The present paper is concerned with the study of manifold-valued multiscale transforms with a focus on the Stiefel manifold. For this specific geometry we derive several formulas and algorithms for the computation of geometric means which will later enable us to construct multiscale transforms of wavelet type. As an application we study compression of piecewise smooth families of low-rank matrices both for synthetic data and also real-world data arising in hyperspectral imaging. As a main theoretical contribution we show that the manifold-valued wavelet transforms can achieve an optimal N -term approximation rate for piecewise smooth functions with possible discontinuities. This latter result is valid for arbitrary manifolds. AMS Subject Classification: primary 42C40, 65N12 secondary 65N15, 65N30, 42C99
منابع مشابه
The geometry of rank decompositions of matrix multiplication I: 2x2 matrices
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of [3] establishing the symmetry group of Strassen’s algorithm, and present two particularly nice s...
متن کاملThe geometry of rank decompositions of matrix multiplication II: 3×3 matrices
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of [3] establishing the symmetry group of Strassen’s algorithm, and present two particularly nice s...
متن کاملLow-rank Matrices in the Approximation of Tensors
Most successful numerical algorithms for multi-dimensional problems usually involve multi-index arrays, also called tensors, and capitalize on those tensor decompositions that reduce, one way or another, to low-rank matrices associated with the given tensors. It can be argued that the most of recent progress is due to the TT and HT decompostions [1]. The differences between the two decompositio...
متن کاملNew Ranks for Even-Order Tensors and Their Applications in Low-Rank Tensor Optimization
In this paper, we propose three new tensor decompositions for even-order tensors corresponding respectively to the rank-one decompositions of some unfolded matrices. Consequently such new decompositions lead to three new notions of (even-order) tensor ranks, to be called the M-rank, the symmetric M-rank, and the strongly symmetric M-rank in this paper. We discuss the bounds between these new te...
متن کاملNonnegative Ranks, Decompositions, and Factorizations of Nonnegative Matrices
The nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one matrices into which the matrix can be decomposed additively. Such decompositions are useful in diverse scientific disciplines. We obtain characterizations and bounds and show that the nonnegative rank can be computed exactly over the reals by a finite algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 30 شماره
صفحات -
تاریخ انتشار 2013